The hierarchical hub median problem with single assignment
نویسندگان
چکیده
منابع مشابه
Complete / Incomplete Hierarchical Hub Center Single Assignment Network Problem
In this paper we present the problem of designing a three level hub center network. In our network, the top level consists of a complete network where a direct link is between all central hubs. The second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. We model this problem in an incomplete net...
متن کاملcomplete / incomplete hierarchical hub center single assignment network problem
in this paper we present the problem of designing a three level hub center network. in our network, the top level consists of a complete network where a direct link is between all central hubs. the second and third levels consist of star networks that connect the hubs to central hubs and the demand nodes to hubs and thus to central hubs, respectively. we model this problem in an incomplete net...
متن کاملthe capacitated hierarchical p-hub median problem considering delivery time
in this paper, a hierarchical p-hub median problem is considered that all the nodes and arcs on the network have limited capacities. proposed model has three-level where the complete network at the top level consists of the central hubs. the second and third levels consist of hub and demand nodes respectively, which are connected through star networks. also, delivery time restriction is taken i...
متن کاملModeling of the Capacitated Single Allocation Hub Location Problem with a Hierarchical Approch (TECHNICAL NOTE)
The hierarchical hub covering facility location problems are applied to distribution systems, transportation, waste disposal, treatment services, emergency services and remote communication. The problems attempt to determine the location of service providers' facilities at different levels and specify their linking directions in order to reduce costs and to establish an appropriate condition in...
متن کاملOn the single-assignment p-hub center problem
We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than dierent linearizations of the basic model. We also prove the NP-Hardness of the problem. Ó 2000 Elsevier Science B.V. All rights reserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part B: Methodological
سال: 2009
ISSN: 0191-2615
DOI: 10.1016/j.trb.2009.01.005